Further Towards a Uni cation of
نویسنده
چکیده
Traditionally, parallel programming paradigms are associated with only a single class of parallel architecture. No single model of parallel computation has been able to span the range of parallel architecture classes. This has resulted in a lack of portability of software between parallel architectures, also a lack of portability of programmers' skills. This report describes the latest developments and revisions of the author's work in unifying the basic parallel architecture classes. The original aim was to produce a single, uniied parallel architecture class. Each individual parallel architecture class has a parallel programming paradigm traditionally associated with itself. The uniied parallel architecture class would be capable of supporting all those parallel programming paradigms. However, the results of this uniication process demonstrate that all parallel architecture classes are capable of eeciently simulating the computation (control methods and memory access) of all other parallel architecture classes, while communication can not be simulated eeciently due to certain architecture classes being non-scalable in terms of bandwidth.
منابع مشابه
Grand Uni cation at Intermediate Mass Scales through Extra Dimensions
One of the drawbacks of conventional grand uni cation scenarios has been that the uni cation scale is too high to permit direct exploration. In this paper, we show that the uni cation scale can be signi cantly lowered (perhaps even to the TeV scale) through the appearance of extra spacetime dimensions. Such extra dimensions are a natural consequence of string theories with largeradius compacti ...
متن کاملConsistency and re nement for partial speci cation in
This paper discusses theoretical background for the use of Z as a language for partial speci cation in particular techniques for check ing consistency between viewpoint speci cations The main technique used is uni cation i e nding a candidate least common re nement The corresponding notion of consistency between speci cations turns out to be di erent from the known notions of consistency for si...
متن کاملSolving higher order equations: from logic to programming
Higher order constructs provide the necessary level of abstraction for concise and natural formulations in many areas of computer science We present constructive methods for higher order equational reasoning with applications ranging from theorem proving to novel programming concepts A major problem of higher order programming is the undecidability of higher order uni cation In the rst part we ...
متن کاملMatching and Uni cation in Rewrite Theories
\Semantic uni cation" is the process of generating a basis set of substitutions (of terms for variables) that makes two given terms equal in a speci ed theory. Semantic uni cation is an important component of some theorem provers. \Semantic matching," a simpler variant of uni cation, where the substitution is made in only one of the terms, has potential usage in programming language interpreter...
متن کاملSyntactic Uni cation Problems under Constrained Substitutions
Some kind of practical problems such as security veri cation of cryptographic protocols can be described as a problem to accomplish a given purpose by using limited operations and limited materials only. To model such problems in a natural way, uni cation problems under constrained substitutions have been proposed. This paper is a collection of results on the decidability and the computational ...
متن کاملPolytypic Uni cation
Uni cation or two way pattern matching is the process of solving an equation involving two rst order terms with variables Uni cation is used in type inference in many pro gramming languages and in the execution of logic programs This means that uni cation algorithms have to be written over and over again for di erent term types Many other functions also make sense for a large class of datatypes...
متن کامل